A closed form expression for the causal set d’Alembertian

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalar Field Theory on a Causal Set in Histories Form

We recast into histories-based form a quantum field theory defined earlier in operator language for a free scalar field on a background causal set. The resulting decoherence functional resembles that of the continuum theory but the counterpart of the d’Alembertian operator is nonlocal and a generalized inverse of the discrete retarded Green function. We comment on the significance of this and w...

متن کامل

A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games

Abstract   This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...

متن کامل

Deriving a closed-form expression for worm-scanning strategies

This work presents a closed-form expression for characterizing the spread of a class of worm-scanning strategies through a mean-field approximation. This expression can both accurately capture the worm propagation speed before the number of infections becomes large and explicitly demonstrate the effects of important parameters such as the vulnerable-host distribution and the worm-scanning strat...

متن کامل

Closed-form expression for the parameters of binary lexicodes

A minimum distance d binary lexicode is greedily constructed as follows: start with the all-zero vector; repeatedly add (until exhaustion) the lexicographically earliest (i.e., appearing first in a dictionary) vector at Hamming distance ≥ d from the previously chosen codewords. The length of the code is determined as the support size of the code. As a simple example, constructing the minimum di...

متن کامل

Closed-Form Expression for Focal Lengths from the Fundamental Matrix

We describe an algorithm for decomposing a fundamental matrix computed from point correspondences over two images into the focal lengths of the two images and the camera motion parameters in a closed-form expression. Our algorithm is based on the decomposability condition of the essential matrix expressed in terms of its scalar invariants. We give a complete analysis for degenerate camera con g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Classical and Quantum Gravity

سال: 2014

ISSN: 0264-9381,1361-6382

DOI: 10.1088/0264-9381/31/9/095007